Adaptive Genetic Algorithms for Multi-resource Constrained Project Scheduling Problem with Multiple Modes

نویسندگان

  • KwanWoo Kim
  • Mitsuo Gen
  • MyoungHun Kim
  • M. H. KIM
چکیده

In modern manufacturing systems like multi-resource constrained project scheduling problem with the multiple modes (mcPSP-mM) is complicated because of the complex interrelationships between the units of the different stages. In this paper, we develop an adaptive genetic algorithm (aGA) to solve the mcPSP-mM which is a well known NP-hard problem. A new aGA algorithm approach for solving these mcPSP-mM problems is 1) the design of priority-based encoding for activity priority and multistage-based encoding for activity mode, 2) order-based crossover operator for activity priority and local search-based mutation operator for activity mode, 3) iterative hill-climbing method in GA loop, 4) auto-tuning for the rates of crossover and mutation operators. The numerical experiments show that the proposed aGA is effective to the mcPSP-mM.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Genetic Algorithm and a Model for the Resource Constrained Project Scheduling Problem with Multiple Crushable Modes

Abstract: This paper presents an exact model and a genetic algorithm for the multi-mode resource constrained project scheduling problem with generalized precedence relations in which the duration of an activity is determined by the mode selection and the duration reduction (crashing) applied within the selected mode. All resources considered are renewable. The objective is to determine a mode, ...

متن کامل

A Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm

In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...

متن کامل

Optimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: NSGA-II and MOICA algorithms

The aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategi...

متن کامل

An Optimization via Simulation approach for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problems

In this paper a novel modelling and solving method has been developed to address the so-called resource constrained project scheduling problem (RCPSP) where project tasks have multiple modes and also the preemption of activities are allowed. To solve this NP-hard problem, a new general optimization via simulation (OvS) approach has been developed which is the main contribution of the current re...

متن کامل

A Bi-objective Pre-emption Multi-mode Resource Constrained Project Scheduling Problem with due Dates in the Activities

In this paper, a novel mathematical model for a preemption multi-mode multi-objective resource-constrained project scheduling problem with distinct due dates and positive and negative cash flows is presented. Although optimization of bi-objective problems with due dates is an essential feature of real projects, little effort has been made in studying the P-MMRCPSP while due dates are included i...

متن کامل

A multi-objective resource-constrained optimization of time-cost trade-off problems in scheduling project

This paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. The net present value (NPV) maximization and making span minimization are this study objectives. And since this problem is considered as complex optimization in NP-Hard context, we present a mathematical model for the given problem and solve three evolutionary algorithms;...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005